catnap: Generating Test Suites of Constrained Combinatorial Testing with Answer Set Programming
نویسندگان
چکیده
We develop an approach to test suite generation for Constrained Combinatorial Testing (CCT), one of the most widely studied combinatorial testing techniques, based on Answer Set Programming (ASP). The resulting catnap system accepts a CCT instance in fact format and combines it with a first-order encoding for generating test suites, which can subsequently be solved by any off-the-shelf ASP systems. We evaluate the effectiveness of our approach by empirically contrasting it to the best known bounds obtained via dedicated implementations.
منابع مشابه
Constrained Videogame Content Generation with Answer Set Programming
Automatically generating content for videogames (often called procedural content generation or PCG) requires developing systems that can synthesize artifacts that are both deeply relevant to a designer’s vision and appropriate for a player’s experience in a game so far. PCG work has historically proceeded by developing algorithms for each combination of content type and design requirements. As ...
متن کاملHandling constraints in combinatorial interaction testing in the presence of multi objective particle swarm and multithreading
Context: Combinatorial tes applications. In its simple rations) of a system into configurations of software systems. To implement th are many combinatorial in Constrained combinatorial interaction ulti-objective particle swarm optimisation est generation tools earch-based software engineering est case design techniques Objective: This paper presents presence of constraints. Method: The design a...
متن کاملGenerating Event-Sequence Test Cases by Answer Set Programming with the Incidence Matrix
The effective use of ASP solvers is essential for enhancing efficiency and scalability. The incidence matrix is a simple representation used in Constraint Programming (CP) and Integer Linear Programming for modeling combinatorial problems. Generating test cases for event-sequence testing is to find a sequence covering array (SCA). In this paper, we consider the problem of finding optimal sequen...
متن کاملCombining Satisfiability Solving and Heuristics to Constrained Combinatorial Interaction Testing
Combinatorial interaction testing aims at revealing errors inside a system under test triggered by unintended interaction between values of its input parameters. In this context we de ned a new greedy approach to generate a combinatorial interaction test suites in the presence of constraints, based on integration of an SMT solver, and ordered processing of test goals. Based on the observation t...
متن کاملT-wise combinatorial interaction test suites construction based on coverage inheritance
Combinatorial interaction testing (CIT) is a testing technique which requires covering all t-sized tuples of values out of n parameters attributes or properties, modeled after the input parameters or the configuration domain of a system under test. CIT test suites have shown to be very effective in software testing already at pairwise (t = 2) level, and that effectiveness of CIT grows with the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017